“Weak yet strong” restrictions of Hindman’s Finite Sums Theorem∗
نویسنده
چکیده
We present a natural restriction of Hindman’s Finite Sums Theorem that admits a simple combinatorial proof (one that does not also prove the full Finite Sums Theorem) and low computability-theoretic and proof-theoretic upper bounds, yet implies the existence of the Turing Jump, thus realizing the only known lower bound for the full Finite Sums Theorem. This is the first example of this kind. In fact we isolate a rich family of similar restrictions of Hindman’s Theorem with analogous properties.
منابع مشابه
A Simple Proof of Hindman’s Theorem
We give a short, explicit proof of Hindman’s Theorem that in every finite coloring of the integers, there is an infinite set all of whose finite sums have the same color. Building on the observation that two of the existing proofs, those by Baumgartner and Galvin-Glazer, have similar divisions of the proof into two stages, we give a proof similar to Hindman’s original argument, but with an anal...
متن کاملUsing Βs in Combinatorics and Dynamical Systems (survey)
1. Basic properties of ultrafilters 2. Applications of ultrafilters. The space βS 3. Semigroups: basic facts and examples 4. βS as a semigroup 5. Hindman’s finite sums theorem 6. Semigroups: ideals and minimal idempotents 7. The Hales-Jewett theorem 8. Large sets: thick, central, IP-, and syndetic sets 9. Large sets: piecewise syndetic sets 10. Dynamical systems: basic notions 11. βS as a dynam...
متن کاملA Multidimensional Central Sets Theorem
t∈α xt : α ∈ Pf (ω)}. A set A ⊆ N is called an IP-set iff there exists a sequence 〈xn〉n=0 in N such that FS(〈xn〉n=0) ⊆ A. (This definitions make perfect sense in any semigroup (S, ·) and we indeed plan to use them in this context. FS is an abbriviation of finite sums and will be replaced by FP if we use multiplicative notation for the semigroup operation.) Now Hindman’s Theorem states that in a...
متن کاملA Multidimensional Central Sets Theorem
t∈α xt : α ∈ Pf (ω)}. A set A ⊆ N is called an IP-set iff there exists a sequence 〈xn〉n=0 in N such that FS(〈xn〉n=0) ⊆ A. (This definitions make perfect sense in any semigroup (S, ·) and we indeed plan to use them in this context. FS is an abbriviation of finite sums and will be replaced by FP if we use multiplicative notation for the semigroup operation.) Now Hindman’s Theorem states that in a...
متن کاملHindman’s Theorem in Abelian Groups
Hindman’s theorem tells us that for every finite colouring/partition of the natural numbers, there is an infinite subset X for which every finite subset X0 Ď X has the same colour for ř X0. Certain generalisations of this theorem to abelian groups are known to fail in the uncountable case but an example exists for boolean groups when the desired homogeneous set is finite. In this paper, I will ...
متن کامل